Linear-Depth Quantum Circuits for n-qubit To oli gates with no Ancilla

نویسندگان

  • Mehdi Saeedi
  • Massoud Pedram
چکیده

This paper presents a quantum circuit design with linear depth to implement an n-qubit To oli gate. The proposed design, which uses no ancilla qubit, is a quadratic-size circuit comprising elementary 2-qubit controlled-rotation gates around the x axis. The circuit depth remains linear even in quantum circuit architectures with only adjacent neighbor interactions among the qubits. This design is related to the long-standing construction by Barenco et al. (Phys. Rev. A, 52: 34573467, 1995), which uses a quadratic-size, quadratic-depth quantum circuit for an n-qubit To oli gate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla

We design a circuit structure with linear depth to implement an n-qubit Toffoli gate. The proposed construction uses a quadratic-size circuit consists of elementary 2-qubit controlled-rotation gates around the x axis and uses no ancilla qubit. Circuit depth remains linear in quantum technologies with finite-distance interactions between qubits. The suggested construction is related to the longs...

متن کامل

Smaller Circuits for Arbitrary N-qubit Diagonal Computations *

Several known algorithms for synthesizing quantum circuits in terms of elementary gates reduce arbitrary computations to diagonal [1, 2]. Circuits for n-qubit diagonal computations can be constructed using one (n − 1)-controlled one-qubit diagonal computation [3] and one inverter per pair of diagonal elements, not unlike the construction of classical AND-OR-NOT circuits based on the lines of a ...

متن کامل

A Class of Efficient Quantum Incrementer Gates for Quantum Circuit Synthesis

The quantum incrementer is one of the simplest quantum operators, which exhibits basic arithmetic operations such as addition, the propagation of carry qubits and the resetting of carry qubits. In this paper, three quantum incrementer gate circuit topologies are derived and compared based upon their total number of gates, the complexity of the circuits, the types of gates used and the number of...

متن کامل

3 Smaller Circuits for Arbitrary n - qubit Diagonal Computations ∗

Several known algorithms for synthesizing quantum circuits in terms of elementary gates reduce arbitrary computations to diagonal [1, 2]. Circuits for n-qubit diagonal computations can be constructed using one (n − 1)-controlled one-qubit diagonal computation [3] and one inverter per pair of diagonal elements, not unlike the construction of classical AND-OR-NOT circuits based on the lines of a ...

متن کامل

A New Lower Bound Technique for Quantum Circuits without Ancillae

We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation that in circuits without ancillæ, only a few input states can set all the control qubits of a To↵oli gate to 1. This can be used to selectively remove large To↵oli gates from a quantum circuit while keeping the cumulative error low. We use the technique to give another proof that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013